Relaxation Optimization
نویسندگان
چکیده
The NMR detection of methyl groups is of keen interest because they provide the long-range distance information required to establish global folds of high molecular weight proteins. Using longitudinal H relaxation optimization, we achieve a gain in sensitivity of approximately 1.6-fold in the methyl-TROSY and its NOESY experiments for the 38 kDa protein mitogen activated protein kinase p38 in its fully protonated and C and N labeled state.
منابع مشابه
SDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملISOGEOMETRIC TOPOLOGY OPTIMIZATION OF STRUCTURES CONSIDERING WEIGHT MINIMIZATION AND LOCAL STRESS CONSTRAINTS
The Isogeometric Analysis (IA) is utilized for structural topology optimization considering minimization of weight and local stress constraints. For this purpose, material density of the structure is assumed as a continuous function throughout the design domain and approximated using the Non-Uniform Rational B-Spline (NURBS) basis functions. Control points of the density surface are...
متن کاملExploiting Sparsity in SDP Relaxation for Sensor Network Localization
A sensor network localization problem can be formulated as a quadratic optimization problem (QOP). For quadratic optimization problems, semidefinite programming (SDP) relaxation by Lasserre with relaxation order 1 for general polynomial optimization problems (POPs) is known to be equivalent to the sparse SDP relaxation by Waki et al. with relaxation order 1, except the size and sparsity of the ...
متن کاملSemi - Lagrangian relaxation ∗
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used in (linear) combinatorial optimization with equality constraints generates an optimal integer solution. We call this new concept semi-Lagrangian relaxation and illustrate its practical value by solving large-scale instan...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کامل